Combinatorics of optimal designs
نویسندگان
چکیده
There is a very famous joke about Bose’s work in Giridh. Professor Mahalanobis wanted Bose to visit the paddy fields and advise him on sampling problems for the estimation of yield of paddy. Bose did not very much like the idea, and he used to spend most of the time at home working on combinatorial problems using Galois fields. The workers of the ISI used to make a joke about this. Whenever Professor Mahalanobis asked about Bose, his secretary would say that Bose is working in fields, which kept the Professor happy.
منابع مشابه
New D-optimal designs via cyclotomy and generalised cyclotomy
D-optimal designs are n x n ±l-matrices where n == 2 mod 4 with maximum determinant. D-optimal designs obtained via circulant matrices are equivalent to 2-{ v; kl i k2 i k1 + k2 ~(v 1)} supplementary difference sets, where v = ~. We use cyclotomy to construct D-optimal designs, where v is a prime. We give a generalisation of cyclotomy and extend the cyclotomic techniques which enables use to fi...
متن کاملSmall non-isomorphic repeated measurements designs
Over the last few years a number of authors have investigated the structure of optimal measurements designs. Various constructions for such designs have been given. In this paper we consider the construction of non-isomorphic optimal repeated measurements designs when t=2 and
متن کامل(M, S)-optimal designs with block size three
The existence of (M, B)-optimal designs for block size three is completely settled. Such a design is a collection of b triples on v elements so that for every two elements the numbers of triples containing them differ by at most one, and for every two pairs of elements the numbers of triples containing them also differ by at most one.
متن کاملA-efficient balanced treatment incomplete block designs
The purpose of this paper is to present a large number of highly A-efficient incomplete block designs for making comparisons among a set of test treatments and a control treatment. These designs are BTIB designs. A simple method of construction of BTIB designs, based on BIB designs is proposed. The advantage of this method is that one can use the vast literature on BIB designs to obtain a large...
متن کاملFinding D-optimal designs by randomised decomposition and switching
A square {+1,−1}-matrix of order n with maximal determinant is called a saturated D-optimal design. We consider some cases of saturated Doptimal designs where n > 2, n ≡ 0 mod 4, so the Hadamard bound is not attainable, but bounds due to Barba or Ehlich and Wojtas may be attainable. If R is a matrix with maximal (or conjectured maximal) determinant, then G = RR is the corresponding Gram matrix....
متن کامل